منابع مشابه
Edit Distance with Block Deletions
Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves. We show that the edit distance with block moves and block deletions is NP-complete (Nondeterministic Polynomial time problems in which any given s...
متن کاملTree edit distance with gaps
The purpose of this paper is to study the definition of edit distances with convex gap weights for trees. In the special case of strings, this problem has yield to the definition of classical solutions: Galil and Giancarlo produced in [2] an algorithm in O(n log(n)), for example. For trees, standart edit distance algorithms – [7] or more recently [4] with a O(n log(n))) solution – are concerned...
متن کاملEdit Distance with Move Operations
The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of a string represented by a singly linked list (one character per node) and being able to apply these operations to the pointer associated with a vertex a...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملEdit Distance in Graphs
The focus of my research is extremal graph theory and random combinatorial structures. I have also worked in a variety of other areas, including intersecting hypergraphs, the theory of positional games and Ramsey theory. I use a number of tools in my research, notably probabilistic methods and, most prominently, Szemerédi’s regularity lemma. I have used these and other techniques to address que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2011
ISSN: 1999-4893
DOI: 10.3390/a4010040